# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def countBattleships(self, board: List[List[str]]) -> int:
        battle = 'X'
        free = '.'
        ans = 0

        col = len(board[0])
        row = len(board)

        for i in range(row):
            for j in range(col):
                if board[i][j] == battle:
                    board[i][j] = free
                    ans += 1
                    for k in range(j + 1, col):
                        if board[i][k] == battle:
                            board[i][k] = free
                        else:
                            break

                    for l in range(i + 1, row):
                        if board[l][j] == battle:
                            board[l][j] = free
                        else:
                            break

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([["X", ".", ".", "X"], [".", ".", ".", "X"], [".", ".", ".", "X"]], 2),
        ([["."]], 0)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.countBattleships(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)
